Euclidean reconstruction of a circular truncated cone only from its uncalibrated contours

نویسندگان

  • Yihong Wu
  • Guanghui Wang
  • Fuchao Wu
  • Zhanyi Hu
چکیده

We present a method to recover a circular truncated cone only from its contour up to a similarity transformation. First, we find the images of circular points, and then use them to calibrate the camera with constant intrinsic parameters from two or three contours of a circular truncated cone, or from a single contour of a circular truncated cylinder. Second, we give an analytical solution of the relative pose between each camera and the circular truncated cone. After the camera’s intrinsic parameters and pose are recovered, the circular truncated cone or cylinder is reconstructed from one image. Experiments on both simulated data and real images are performed and validate our approach. q 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A full Nesterov-Todd step interior-point method for circular cone optimization

In this paper, we present a full Newton step feasible interior-pointmethod for circular cone optimization by using Euclidean Jordanalgebra. The search direction is based on the Nesterov-Todd scalingscheme, and only full-Newton step is used at each iteration.Furthermore, we derive the iteration bound that coincides with thecurrently best known iteration bound for small-update methods.

متن کامل

Primal-dual path-following algorithms for circular programming

Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...

متن کامل

Scaled Euclidean 3d Reconstruction Based on Externally Uncalibrated Cameras

Previous work shows that based on ve non-coplanar correspondences of two uncalibrated cameras , 3D reconstruction can be achieved under projec-tive models, or based on four non-coplanar correspondences of two uncalibrated cameras, 3D reconstruction can be achieved under aane models, with three unknown parameters. In this paper, we show that based on four coplanar correspondences of two external...

متن کامل

Affine Reconstruction of Curved Surfaces from Uncalibrated Views of Apparent Contours

in this paper, we consider uncaiibrated reconstruction of curved surfaces from apparent contours. Since apparent contours are not fixed features (viewpoint independent), we cannot directly apply the recent resuits of the uncaiibrated reconstruction from fixed features. We show that, nonetheless, curved surfaces can be reconstructed up to an affine ambiguity from their apparent contours viewed f...

متن کامل

Euclidean Structure from Uncalibrated Images

A number of recent papers have demonstrated that camera "selfcalibration" can be accomplished purely from image measurements, without requiring special calibration objects or known camera motion. We describe a method, based on self-calibration, for obtaining (scaled) Euclidean structure from multiple uncalibrated perspective images using only point matches between views. The method is in two st...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Image Vision Comput.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 2006